Oversampled Graph Laplacian Matrix for Graph Filter Banks
نویسندگان
چکیده
منابع مشابه
Medical Image Fusion in Oversampled Graph Filter Banks
Recently, oversampled graph filter banks (OSGFBs) have been constructed on graph theory for signal processing in [1]-[7]. This paper introduces a new image fusion for medical images in OSGFBs. Images are decomposed to subband images by spectral graph wavelet transform in OSGFBs, revised by a simple fusion rule, and synthesized back to make a fused image. Since the OSGFBs have good capability to...
متن کاملMultidimensional Oversampled Filter Banks
We present the characterization and design of multidimensional oversampled FIR filter banks. In the polyphase domain, the perfect reconstruction condition for an oversampled filter bank amounts to the invertibility of the analysis polyphase matrix, which is a rectangular FIR matrix. For a nonsubsampled FIR filter bank, its analysis polyphase matrix is the FIR vector of analysis filters. A major...
متن کاملNonsubsampled Graph Filter Banks and Distributed Implementation
In this paper, we consider nonsubsampled graph filter banks (NSGFBs) to process data on a graph in a distributed manner. Given an analysis filter bank with small bandwidth, we propose algebraic and optimization methods of constructing synthesis filter banks such that the corresponding NSGFBs provide a perfect signal reconstruction in the noiseless setting. Moreover, we prove that the proposed N...
متن کاملFast Implementation of Oversampled Modulated Filter Banks
This paper presents an efficient implementation of oversampled filter banks derived from a prototype filter by modulation. Via a polyphase analysis, redundancies in the filter operations are removed. With some modifications, a very simple and efficient implementation is found, which is briefly compared to existing realisations.
متن کاملLaplacian Matrix in Algebraic Graph Theory
In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are una...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2365761